Simplification of objects for adaptive matching and visualization

نویسندگان

  • András Hajdu
  • Péter Veres
  • Attila Tanács
چکیده

In this paper, we present a method for the simplification of the geometry of 2D and 3D objects. Our apporach allows us to perform both uniform and non-uniform simplification. Our purposes are twofold. On the one hand, we can make matching algorithms faster in object detection using simplified geometries. Moreover, with non-uniform simplification we can adjust the quality of the visualization of the object details regarding the importance of the different parts of the object. In this way, we improve computational performance since less template points are matched using a simplified template, and some information can be handled as less important in visualization. We demonstrate how we can take advantage of selecting special weight functions for matching and visualization purposes besides the uniform one. The theoretical background of the simplification is derived through the centroidal Voronoi tessellation framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kohonen Self Organizing for Automatic Identification of Cartographic Objects

Automatic identification and localization of cartographic objects in aerial and satellite images have gained increasing attention in recent years in digital photogrammetry and remote sensing. Although the automatic extraction of man made objects in essence is still an unresolved issue, the man made objects can be extracted from aerial photos and satellite images. Recently, the high-resolution s...

متن کامل

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

متن کامل

Matching of Polygon Objects by Optimizing Geometric Criteria

Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....

متن کامل

A graph-based shape matching scheme for 3D articulated objects

In this paper, a novel graph-based shape matching scheme for three-dimensional articulated objects is introduced. The underlying graph structure of a given 3D model is composed of its topological skeleton and local geometric features. Matching two graph structures is generally an NP-hard combinatorial optimization problem. To reduce computation cost, two graphs are embedded on a high-dimensiona...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007